Clustering Fuzzy Relational Data base on fuzzy Cardinality
نویسنده
چکیده
Our purpose is to provide a set-theoretical frame to clustering fuzzy relational data basically based on the cardinality of the fuzzy subsets and their complementaries that represent the objects under study, without applying any crisp property when the various elements that compose the process are fuzzified. From this perspective we define a family of fuzzy similarity indexes which includes a set of fuzzy indexes introduced by Tolias et al, and we analyze under which conditions a fuzzy proximity relation is defined. Following an original idea due to S. Miyamoto we evaluate the similarity between objects and between clusters by means the same mathematical procedure. Joining these concepts and methods we establish an algorithm to clustering fuzzy relational data. Finally, we present an example to make clear the whole process.
منابع مشابه
I Spatio - Temporal Database Using Fuzzy Clustering
Given a large spatio-temporal data of events, where each event consists of the following fields. Event-Id, time, location, event type. A wide range of database applications manage time-varying data. In contrast, existing database technology provides little support for managing such data. The research area of temporal databases aims to change this state of affairs by characterizing the semantics...
متن کاملRobust Extension of FCMdd-based Linear Clustering for Relational Data using Alternative c -Means Criterion
Relational clustering is an extension of clustering for relational data. Fuzzy c-Medoids (FCMdd) based linear fuzzy clustering extracts intrinsic local linear substructures from relational data. However this linear clustering was affected by noise or outliers because of using Euclidean distance. Alternative Fuzzy c-Means (AFCM) is an extension of Fuzzy c-means, in which a modified distance meas...
متن کاملClustering Based Automatic Fuzzy Partitioning of Numerical Attributes
Partitioning of quantified attributes is essential for mining association rules from quantified data and the Fuzzy approach solves the sharp boundary problem giving Fuzzy association rules having high interpretability and rich applicability. The paper presents automated partitioning of numerical data into Fuzzy sets based on k means clustering algorithm. This can be used as a pre-processing ste...
متن کاملLow-complexity fuzzy relational clustering algorithms for Web mining
This paper presents new algorithms (Fuzzy c-Medoids or FCMdd and Robust Fuzzy c-Medoids or RFCMdd) for fuzzy clustering of relational data. The objective functions are based on selecting c representative objects (medoids) from the data set in such a way that the total fuzzy dissimilarity within each cluster is minimized. A comparison of FCMdd with the well-known Relational Fuzzy c-Means algorit...
متن کاملA Fuzzy Relational Clustering Algorithm with q-weighted Medoids ?
Medoids-based fuzzy relational clustering generates clusters of objects based on relational data, which records pairwise similarity or dissimilarities among objects. Compared with single-medoid based approaches, multiple-weighted medoids has shown superior performance in clustering. In this paper, we present a new version of fuzzy relational clustering in this family called fuzzy clustering wit...
متن کامل